A COMPARISON OF PARALLEL BRANCH AND BOUND ALGORITHMS FOR LOCATION-TRANSPORTATION PROBLEMS IN HUMANITARIAN RELIEF
نویسندگان
چکیده
منابع مشابه
A Comparison of Parallel Branch and Bound Algorithms for Location-transportation Problems in Humanitarian Relief
This paper studies the effect of branching rules (BR) and heuristic algorithms (HA) to find feasible solutions for a branch and bound (BB) algorithm used to solve sub-problems in a parallel two-phase branch and bound (PTBB) approach. The nine PTBB algorithms, which are developed by varying 3 combinations of BR and HA strategies, are tested on the facility location-transportation problem for dis...
متن کاملAn Exact Algorithm for Location–Transportation Problems in Humanitarian Relief
Abstract—This paper proposes a mathematical model and examines the performance of an exact algorithm for a location– transportation problems in humanitarian relief. The model determines the number and location of distribution centers in a relief network, the amount of relief supplies to be stocked at each distribution center and the vehicles to take the supplies to meet the needs of disaster vi...
متن کاملParallel Branch-and-Bound Algorithms
1.1. INTRODUCTION In the beginning of the twenty-first century, large unsolved combinatorial optimization problems have been solved exactly. Two impressive cases should be mentioned. First are two instances of the Monde, Transfert) newspapers. This impressive media frenzy reflected the impact of the achievement, which was deemed of the same order of magnitude as the victory of IBMs parallel com...
متن کاملFacility location in humanitarian relief
In this study, we consider facility location decisions for a humanitarian relief chain responding to quick-onset disasters. In particular, we develop a model that determines the number and locations of distribution centres in a relief network and the amount of relief supplies to be stocked at each distribution centre to meet the needs of people affected by the disasters. Our model, which is a v...
متن کاملInitialization of Parallel Branch-and-bound Algorithms
Four different initialization methods for parallel Branch-and-bound algorithms are described and compared with reference to several criteria. A formal analysis of their idle times and efficiency follows. It indicates that the efficiency of three methods depends on the branching factor of the search tree. Furthermore, the fourth method offers the best efficiency of the overall algorithm when a c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of GEOMATE
سال: 2017
ISSN: 2186-2990
DOI: 10.21660/2017.33.2563